Causes of proof construction failure in proof by contradiction

Negation and Proof by Contradiction in Access-Limited Logic

Access-Limited Logic (ALL) is a language for knowledge representation which formalizes the access limitations inherent in a network structured knowledge-base. Where a deductive method such as resolution would retrieve all assertions that satisfy a given pattern, an access-limited logic retrieves all assertions reachable by following an available access path. In this paper, we extend previous wo...

Tamper-Proof Annotations, By Construction

Current mobile-code formats require veri cation by the code recipient to guard against potentially malicious actions of an incoming mobile program. Such veri cation is needed even when a mobile program originated in a \safe" language such as Java, because the transmission might have been corrupted by an adversary. We describe an alternative approach based on a family of mobile code formats that...

A PROOF OF FREEDOM FROM CONTRADICTION By ALONZO

Focussing and proof construction

This paper proposes a synthetic presentation of the Proof Construction paradigm, which underlies most of the research and development in the so-called “logic programming” area. Two essential aspects of this paradigm are discussed here: true nondeterminism et partial information. A new formulation of Focussing, the basic property used to deal with non-determinism in proof construction, is presen...

A simple proof of Zariski's Lemma

‎Our aim in this very short note is to show that the proof of the‎ ‎following well-known fundamental lemma of Zariski follows from an‎ ‎argument similar to the proof of the fact that the rational field‎ ‎$mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.